Finite automata based compression of bi-level and simple color images
نویسندگان
چکیده
We introduce generalized nite automata as a tool for speciication of bi-level images. We describe an inference algorithm for generalized nite automata and a lossy compression system for bi-level and simple color images based on this algorithm and vector quantization.
منابع مشابه
Speeding up Lossless Image Compression: Experimental Results on a Parallel Machine
Arithmetic encoders enable the best compressors both for bi-level images (JBIG) and for grey scale and color images (CALIC), but they are often ruled out because too complex. The compression gap between simpler techniques and state of the art compressors can be significant. Storer extended dictionary text compression to bi-level images to avoid arithmetic encoders (BLOCK MATCHING), achieving 70...
متن کاملAsymmetric Coding in (m)-WFA Image Compression
Weighted Finite Automata (WFA) generalize nite automata by attaching real numbers as weights to states and transitions. As shown by Culik and Kari [CK93, CK95, KF94] WFA provide a powerful tool for image generation and compression. The inference algorithm for WFA subdivides an image into a set of nonoverlapping range images and then separately approximates each one with a linear combination of ...
متن کاملOn Succinct Representations of Textured Surfaces by Weighted Finite Automata
Generalized finite automata with weights for states and transitions have been successfully applied to image generation for more than a decade now. Bilevel images (black and white), grayscaleor color-images and even video sequences can be effectively coded as weighted finite automata. Since each state represents a subimage within those automata the weighted transitions can exploit self-similarit...
متن کاملFinite Automata Encoding Geometric Figures
Finite automata are used for the encoding and compression of images. For black-and-white images, for instance, using the quad-tree representation, the black points correspond to ω-words defining the corresponding paths in the tree that lead to them. If the ω-language consisting of the set of all these words is accepted by a deterministic finite automaton then the image is said to be encodable a...
متن کاملA Review on Block Matching Motion Estimation and Automata Theory based Approaches for Fractal Coding
-Fractal compression is the lossy compression technique in the field of gray/color image and video compression. It gives high compression ratio, better image quality with fast decoding time but improvement in encoding time is a challenge. This review paper/article presents the analysis of most significant existing approaches in the field of fractal based gray/color images and video compression,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Graphics
دوره 21 شماره
صفحات -
تاریخ انتشار 1997